Endomorphism nearrings of odd generalized dihedral groups
نویسندگان
چکیده
منابع مشابه
On the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملCalculations of Dihedral Groups Using Circular Indexation
In this work, a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$. Each element of the sequence represents a vertex of the polygon. Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis. Here each symmetry is considered as a system that takes an input circular sequence and g...
متن کاملIsoperimetric Numbers of Cayley Graphs Arising from Generalized Dihedral Groups
Let n, x be positive integers satisfying 1 < x < n. Let Hn,x be a group admitting a presentation of the form 〈a, b | a = b = (ba) = 1〉. When x = 2 the group Hn,x is the familiar dihedral group, D2n. Groups of the form Hn,x will be referred to as generalized dihedral groups. It is possible to associate a cubic Cayley graph to each such group, and we consider the problem of finding the isoperimet...
متن کاملOn Hamilton Circuits in Cayley Digraphs over Generalized Dihedral Groups
In this paper we prove that given a generalized dihedral group DH and a generating subset S, if S∩H 6= ∅ then the Cayley digraph → Cay(DH , S) is Hamiltonian. The proof we provide is via a recursive algorithm that produces a Hamilton circuit in the digraph.
متن کاملHamilton paths in Cayley graphs on generalized dihedral groups
We investigate the existence of Hamilton paths in connected Cayley graphs on generalized dihedral groups. In particular, we show that a connected Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamiltonconnected, unless it is bipartite, in which case it is Hamilton-laceable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1989
ISSN: 0021-8693
DOI: 10.1016/0021-8693(89)90255-x